On Parsing Programming Languages with Turing-Complete Parser

A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for any recursively enumerable language. Despite its computational power, meant to primarily programming and domain-specific languages. It enables a straightforward simulation of number existing algorithms context-free grammars. The list includes both top-down shift-produce methods (such as SLL LL) bottom-up shift-reduce LALR LR), well mixed top-down-and-bottom-up such LLLR. To justify use method, paper provides numerous examples how parser actually made in practice. advised that main part some simple well-established approach, e.g., SLL(1), while syntactically complicated phrases parsed by exploiting full power parser. These may either extensions original language or embedded In all similar cases, no restricted context-free. fact, context-sensitive languages handled quite efficiently.